Jørgen Bang - Jensen , Gregory Gutin
نویسندگان
چکیده
منابع مشابه
Paths, Trees and Cycles in Tournaments
We survey results on paths, trees and cycles in tournaments. The main subjects are hamiltonian paths and cycles, vertex and arc disjoint paths with prescribed endvertices, arc-pancyclicity, oriented paths, trees and cycles in tournaments. Several unsolved problems are included.
متن کاملA polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
We describe a polynomial algorithm for the Hamiltonian cycle problem for semicomplete multipartite digraphs. The existence of such an algorithm was conjectured in [16] (see also [15]).
متن کاملAlternating cycles and paths in edge-coloured multigraphs: A survey
A path or cycle in an edge-coloured multigraph is called alternating if its successive edges differ in colour. We survey results of both theoretical and algorithmic character concerning alternating cycles and paths in edge-coloured multigraphs. We also show useful connections between the theory of paths and cycles in bipartite digraphs and the theory of alternating paths and cycles in edge-colo...
متن کاملOn the Complexity of Hamiltonian Path and Cycle Problems in Certain Classes of Digraphs
We survey results on the sequential and parallel complexity of hamiltonian path and cycle problems in various classes of digraphs which generalize tournaments. We give detailed informations on the difference in difficulties for these problems for the various classes as well as prove new results on hamiltonian paths starting in a specified vertex for a quite general class of digraphs.
متن کاملWeakly Hamiltonian-connected ordinary multipartite tournaments
We characterize weakly Hamiltonian-connected ordinary multipartite tournaments. Our result generalizes such a characterization for tournaments by Thomassen and implies a polynomial algorithm to decide the existence of a Hamiltonian path connecting two given vertices in an ordinary multipartite tournament and find one, if it exists.
متن کامل